package leetcode.weekly.week349;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

//Solution4Test
public class Solution4 {

	public int[] maximumSumQueries(int[] nums1, int[] nums2, int[][] queries) {
		int n = nums1.length;
		Map<Integer, List<Integer>> map = new HashMap<>();
		for (int i = 0; i < n; i++) {
			int num = nums2[i];
			map.computeIfAbsent(num, key -> new ArrayList<>()).add(i);
		}
		return null;
	}
}
